Dual realizability in symmetric logic
نویسندگان
چکیده
منابع مشابه
Realizability in classical logic
The essential aim is to explore the Curry-Howard correspondence : we want to associate a program with each mathematical proof and to consider each theorem as a specification, i.e. to find the common behavior of the programs associated with every proof of this theorem. It is a very difficult and very interesting problem, which I call the ‘‘ specification problem ’’ in what follows. In the first ...
متن کاملMathematical Logic Well-foundedness in realizability
However, the implication from (1) to (2) is equivalent to the principle of dependent choices (as the reader can show for himself) and cannot be proved in ZF. A relation < on X is called well-founded if any of these statements holds. Intuitionistically, the three statements are far from equivalent (hence, in formalizing an intuitionistic notion of well-foundedness, care is needed). Notion (1) is...
متن کاملPrimitive Recursive Realizability and Basic Propositional Logic
Two notions of primitive recursive realizability for arithmetic sentences are considered. The first one is strictly primitive recursive realizability introduced by Z. Damnjanovic in 1994. We prove that intuitionistic predicate logic is not sound with this kind of realizability. Namely there exists an arithmetic sentence which is deducible in the intuitionistic predicate calculus but is not stri...
متن کاملMaximum Realizability for Linear Temporal Logic Specifications
Automatic synthesis from linear temporal logic (LTL) specifications is widely used in robotic motion planning, control of autonomous systems, and load distribution in power networks. A common specification pattern in such applications consists of an LTL formula describing the requirements on the behaviour of the system, together with a set of additional desirable properties. We study the synthe...
متن کاملWorkshop on Realizability Preliminary Version Local Realizability Toposes and a Modal Logic for Computability (extended Abstract)
This work is a step toward developing a logic for types and computation that includes both the usual spaces of mathematics and constructions and spaces from logic and domain theory. Using realizability, we investigate a connguration of three toposes, which we regard as describing a notion of relative computability. Attention is focussed on a certain local map of toposes, which we study rst axio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2001
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(01)00068-9